Chaotic Crossover Operator on Genetic Algorithm

In this paper, chaos based a new arithmetic crossover operator on the genetic algorithm has been proposed. The most frequent issue for the optimization algorithms is stuck on problem's defined local minimum points and it needs excessive amount of time to escape from them; therefore, these algorithms may never find global minimum points. To avoid and escape from local minimums, a chaotic arithmetic crossover operator has been employed on a genetic algorithm. Unimodal and multi modal benchmark functions have been used for comparing and test procedures. The genetic algorithm with this new arithmetic crossover operator has yielded better results than original arithmetic crossover operator does. With this new chaos based arithmetic crossover operator diversity and uniqueness of the genetic algorithm’s late population are increased. Therefore, even in the late stages of the optimization process, the genetic algorithm tried to search the entire search space and improved the best solution. 